the trim loss concentration in one-dimensional cutting stock problem (1d-csp) by defining a virtual cost

nowadays, one-dimensional cutting stock problem (1d-csp) is used in many industrial processes and re-cently has been considered as one of the most important research topic. in this paper, a metaheuristic algo-rithm based on the simulated annealing (sa) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. in this method, the 1d-csp is taken into account as item-oriented and the authors have tried to minimize the trim loss concentration by using the simulated an-nealing algorithm and also defining a virtual cost for the trim loss of each stock. the solved sample problems show the ability of this algorithm to solve the 1d-csp in many cases.